Termination w.r.t. Q proof of TRS/SK902.21.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

bin(x, 0) → s(0)
bin(0, s(y)) → 0
bin(s(x), s(y)) → +(bin(x, s(y)), bin(x, y))

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

bin(x, 0) → s(0)
bin(0, s(y)) → 0
bin(s(x), s(y)) → +(bin(x, s(y)), bin(x, y))

Q is empty.

We use [23] with the following order to prove termination.

Lexicographic path order with status [19].
Quasi-Precedence:

bin₂ > s₁
bin₂ > +₂

Status:

trivial